Causality versus true-concurrency

Causality versus true-concurrency

Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models via adjunctions and (co)reflections while Joyal et al. have defined an abstract notion of equivalence, known as open map bisimilarity. One model has not been integrated into this framework: the causal trees of Darondeau ...

True Concurrency = Interleaving Concurrency + Weak Conflict

In this paper we show that true concurrency is not the same as interleaving concur rency for systems that allow read access More precisely whenever two actions are interleavingly concurrent they are also truly concurrent but the converse is not al ways true due to a phenomena that we call weak con ict that allows the possibility of one writer to act in parallel with one or many readers

Causality and True Concurrency: A Data-flow Analysis of the Pi-Calculus (Extended Abstract)

Causality and True Concurrency: A Dataflow Analysis of the Pi-Calculus

reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer-Verlag. Violations are liable for pr...

A Calculus for True Concurrency

We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisimulations, τ laws for weakly truly concurrent bisimulations, and full congruen...